The First Eccentric Zagreb Index of Linear Polycene Parallelogram of Benzenoid
نویسندگان
چکیده
Let G = (V,E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges, e = uv∈E(G), d(u) is degree of vertex u. Then the first Zagreb polynomial and the first Zagreb index Zg1(G,x) and Zg1(G) of the graph G are defined as ( ) ( ) ∑ u v u d v E G d x + ∈ and ( ) ( ) ∑ e u G v uv E d d = ∈ + respectively. Recently Ghorbani and Hosseinzadeh introduced the first Eccentric Zagreb index as ( ) ( ) ( ) ( ) ( ) ∑ uv E G Zg G ecc v ecc u 1 ∈ + = , that ecc(u) is the largest distance between u and any other vertex v of G. In this paper, we compute this new index (the first Eccentric Zagreb index or third Zagreb index) of an infinite family of linear Polycene parallelogram of benzenoid.
منابع مشابه
On discriminativity of Zagreb indices
Zagreb indices belong to better known and better researched topological indices. We investigate here their ability to discriminate among benzenoid graphs and arrive at some quite unexpected conclusions. Along the way we establish tight (and sometimes sharp) lower and upper bounds on various classes of benzenoids.
متن کاملOn discriminativity of vertex-degree-based indices
A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...
متن کاملOn the second order first zagreb index
Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...
متن کاملSome topological indices of graphs and some inequalities
Let G be a graph. In this paper, we study the eccentric connectivity index, the new version of the second Zagreb index and the forth geometric–arithmetic index.. The basic properties of these novel graph descriptors and some inequalities for them are established.
متن کاملChain hexagonal cacti: extremal with respect to the eccentric connectivity index
In this paper we present explicit formulas for the eccentric connectivity index of three classes of chain hexagonal cacti. Further, it is shown that the extremal chain hexagonal cacti with respect to the eccentric connectivity index belong to one of the considered types. Some open problems and possible directions of further research are mentioned in the concluding section.
متن کامل